The binary decision tree algorithm are studied., the upper bound of its VC dimension was calculated and concluded that: upper bound of the VC dimension of binary decision tree algorithm rises as the node number of its result ( binary decision tree) increases. 运用二叉决策树算法,计算了它的VC维上限,并定性地指出:二叉决策树算法的VC维上限随其结果(决策树)复杂度的增大而提高。